From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
نویسندگان
چکیده
منابع مشابه
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL fo...
متن کاملOn Complementing Nondeterministic Büchi Automata
Several optimal algorithms have been proposed for the complementation of nondeterministic Büchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementation construction would be of significant practical value. Recently, Kupferman and Vardi described a com...
متن کاملComplementing Semi-deterministic Büchi Automata
We introduce an efficient complementation technique for semi-deterministic Büchi automata, which are Büchi automata that are deterministic in the limit: from every accepting state onward, their behaviour is deterministic. It is interesting to study semi-deterministic automata, because they play a role in practical applications of automata theory, such as the analysis of Markov decision processe...
متن کامل“ More Deterministic ” vs . “ Smaller ” Büchi Automata
The standard technique for LTL model checking (M φ) consists on translating the negation of the LTL specification, φ, into a Büchi automaton Aφ, and then on checking if the product M Aφ has an empty language. The efforts to maximize the efficiency of this process have so far concentrated on developing translation algorithms producing Büchi automata which are “as small as possible”, under the im...
متن کاملEquivalence of Deterministic and Nondeterministic Epsilon Automata
For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u1, v, v1, v2, w denote elements of Eω, F denotes a subset of Eω, i, k, l denote natural numbers, T denotes a non empty transition-system over F , and S, T denote subsets of T. One can prove the following propositions: (1) If i ≥ k + l, then i ≥ k. (2) For all finite ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2007
ISSN: 1860-5974
DOI: 10.2168/lmcs-3(3:5)2007